/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;

int main()
{
    IOS;
    ll cnt = 0;
    ll num = 8;
    ll n = 3000;

    while (cnt < n)
    {
        for (ll i = 2; i * 2 <= num; i++)
        {
            if (num % i == 0)
            {
                ll k = num / i;
                ll q = k * i * i;
                ll sq = sqrt(q);
                if (sq * sq == q)
                {
                    cnt++;
                    // cout << num << endl;
                    break;
                }
            }
        }
        if (cnt == n)
        {
            break;
        }
        num++;
    }
    cout << 1 << endl;
    cout << num << endl;
    getchar();
    getchar();
    return 0;
}
